Heuristics from Nature for Hard Combinatorial Optimization Problems
نویسندگان
چکیده
In this paper we try to describe the main characters of Heuristics \derived" from Nature, a border area between Operations Research and Arti cial Intelligence, with applications to graph optimization problems. These algorithms take inspiration from physics, biology, social sciences, and use a certain amount of repeated trials, given by one or more \agents" operating with a mechanism of competition-cooperation. Two introductory sections, devoted respectively to a presentation of some general concepts and to a tentative classi cation of Heuristics from Nature open the work. The paper is then composed of six review sections: each of them concerns a heuristic and its application to an NP-hard combinatorial optimization problem. We consider the following topics: genetic algorithms with timetable problems, simulated annealing with dial-a-ride problems, sampling & clustering with communication spanning tree problems, tabu search with job-shop-scheduling problems, neural nets with location problems, ant system with travelling salesman and quadratic assigment problems.
منابع مشابه
An optimization technique for vendor selection with quantity discounts using Genetic Algorithm
Vendor selection decisions are complicated by the fact that various conflicting multi-objective factors must be considered in the decision making process. The problem of vendor selection becomes still more compli-cated with the inclusion of incremental discount pricing schedule. Such hard combinatorial problems when solved using meta heuristics produce near optimal solutions. This paper propose...
متن کاملCombinatorial optimization and the analysis of randomized search heuristics
Randomized search heuristics have widely been applied to complex engineering problems as well as to problems from combinatorial optimization. We investigate the runtime behavior of randomized search heuristics and present runtime bounds for these heuristics on some well-known combinatorial optimization problems. Such analyses can help to understand better the working principle of these algorith...
متن کاملAlgorithmics for hard problems - introduction to combinatorial optimization, randomization, approximation, and heuristics
Let's read! We will often find out this sentence everywhere. When still being a kid, mom used to order us to always read, so did the teacher. Some books are fully read in a week and we need the obligation to support reading. What about now? Do you still love reading? Is reading only for you who have obligation? Absolutely not! We here offer you a new book enPDFd algorithmics for hard problems i...
متن کاملAccelerating Multiobjective Vlsi Cell Placement with Parallel Evolutionary/tabu Search Heuristics
Multiobjective combinatorial optimization problems in various disciplines remain to be the focus of extensive research due to their inherent hard nature and difficulty of finding near-optimal solutions. Iterative heuristics like Tabu Search (TS) and Simulated Evolution (SimE) have successfully been employed to solve a range of such optimization problems [1]. These heuristics are able to obtain ...
متن کامل